#include<bits/stdc++.h>
using namespace std;
int n,r[100005],ans;
map<int,int> a;
vector<int> cnt;
int main()
{
	freopen("duel.in","r",stdin);
	freopen("duel.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
        scanf("%d",r+i),a[r[i]]+=1;
    for(auto i:a)
        cnt.push_back(i.first);
    for(int i=1;i<cnt.size();i++)
        a[cnt[i-1]]-=a[cnt[i]];
    for(auto i:a)
    {
        ans+=i.second;
        ans=max(0,ans);
    }
    printf("%d",ans);
	return 0;
}
